The Computational Complexity Column
نویسندگان
چکیده
The log-rank conjecture is one of the fundamental open problems in communication complexity. It speculates that the deterministic communication complexity of any two-party function is equal to the log of the rank of its associated matrix, up to polynomial factors. Despite much research, we still know very little about this conjecture. Recently, there has been renewed interest in this conjecture and its relations to other fundamental problems in complexity theory. This survey describes some of the recent progress, and hints at potential directions for future research.
منابع مشابه
Adaptive beamforming in row-column addressed arrays for 3D ultrasound imaging
In recent years, to reduce the complexity of implementation, the use of 2D arrays with restricted row-column addressing has been considered for 3D ultrasound imaging. In this paper, two methods of adaptive beamforming based on the minimum variance method are represented in such a way that the computational load is much less than using the full adaptive beamforming method. In both proposed metho...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملSigact News Complexity Theory Column 32 Introduction to Complexity Theory Column ?? Guest Column: Complexity of Svp | a Reader's Digest 1
We present high-level technical summaries of ve recent results on the computational complexity of the shortest lattice vector problem.
متن کاملThe Computational Complexity Column Progress in Descriptive Complexity
Exploration of the connections between computational complexity, descriptive complexity, and logic remains one of the most active and important areas of theoretical computer science. In this edition of the Computational Complexity Column, we hear from one of the leaders in this area.
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کامل